Transfer Functions and Resolvent Norm Approximation of Large Matrices
نویسنده
چکیده
A unifying framework for methods employed in the approximation of the resolvent norm of nonnor-mal matrices is presented. This formulation uses specific transfer functions, and it provides new information about the approximation properties of these methods and their application in computing the pseudospectrum of matrices. 1. Introduction. We now know that the analysis of matrix-dependent algorithms is considerably more complicated when nonnormal matrices are involved; see for example [5]. In particular, several studies indicate that the eigenvalues of the matrix in question often provide insufficient or even misleading information [20]. This has been the motivation behind recent research on more reliable indicators as well as on methods for their practical computation. Several studies concur that a better accordance between theory and practice can be achieved
منابع مشابه
Pseudospectra Computation of Large Matrices
Transfer functions have been shown to provide monotonic approximations to the resolvent 2-norm of A, R(z) = (A − zI), when associated with a sequence of nested spaces. This paper addresses the open question of the effectiveness of the transfer function scheme for the computation of the pseudospectrum of large matrices. It is shown that the scheme can be combined with certain Krylov type linear ...
متن کاملApproximation of Semigroups and Related Operator Functions by Resolvent Series
Abstract. We consider the approximation of semigroups e and of the functions φj(τA) that appear in exponential integrators by resolvent series. The interesting fact is that the resolvent series expresses the operator functions e and φj(τA), respectively, in efficiently computable terms. This is important for semigroups, where the new approximation is different from well-known approximations by ...
متن کاملParallel Computation of Pseudospectra Using Transfer Functions on a MATLAB-MPI Cluster Platform
One of the most expensive problems in numerical linear algebra is the computation of the -pseudospectrum of matrices, that is, the locus of eigenvalues of all matrices of the form A + E, where the norm of E is bounded by . Several research efforts have been attempting to make the problem tractable by means of better algorithms and utilization of all possible computational resources. One commo...
متن کاملFuzzy Best Simultaneous Approximation of a Finite Numbers of Functions
Fuzzy best simultaneous approximation of a finite number of functions is considered. For this purpose, a fuzzy norm on $Cleft (X, Y right )$ and its fuzzy dual space and also the set of subgradients of a fuzzy norm are introduced. Necessary case of a proved theorem about characterization of simultaneous approximation will be extended to the fuzzy case.
متن کاملUniform Approximation of φ-Functions in Exponential Integrators by a Rational Krylov Subspace Method with Simple Poles
We consider the approximation of the matrix φ-functions that appear in exponential integrators for stiff systems of differential equations. For stiff systems, the field-of-values of the occurring matrices is large and lies somewhere in the left complex half-plane. In order to obtain an efficient method uniformly for all matrices with a field-of-values in the left complex half-plane, we consider...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998